Scalable acceleration of database query operations

ABSTRACT

Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

BACKGROUND

The present invention relates to accelerating multiple query processingoperations, and more specifically, to a system of accelerators forscalable acceleration of database query operations.

In general, a single database query includes multiple query processingoperations. These query processing operations include, but are notlimited to, sort operations, decompression operations, predicateevaluation operations, and join operations. Hardware acceleration ofquery operations has shown significant performance improvements oversoftware implementations. This performance improvement is due to customdata paths and parallelism that can be achieved in hardwareimplementations.

Currently, a query operator is evaluated on a single hardwareaccelerator. The available resources on a single accelerator can limitthe performance gains provided by the accelerator. While offloading moreoperations from the host to the accelerator is desirable for higheroverall performance, offloading multiple operations onto a singleaccelerator chip can reduce the amount of resource available to eachoperation, thereby potentially resulting in lower performance gains.

SUMMARY

Embodiments include methods, systems and computer program products foroffloading multiple processing operations to an accelerator. Aspectsinclude receiving a database query from an application, performing ananalysis on the query, and identifying a plurality of availableaccelerators. Aspects further include retrieving cost information forone or more templates available on each of the plurality of availableaccelerators, determining a query execution plan based on the costinformation and the analysis on the query, and offloading one or morequery operations to at least one of the plurality of accelerators basedon the query execution plan.

Additional features and advantages are realized through the techniquesof the present invention. Other embodiments and aspects of the inventionare described in detail herein and are considered a part of the claimedinvention. For a better understanding of the invention with theadvantages and the features, refer to the description and to thedrawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The forgoing and other features, and advantages ofthe invention are apparent from the following detailed description takenin conjunction with the accompanying drawings in which:

FIG. 1 depicts a block diagram of a computer system for practicing theteachings herein according to an embodiment;

FIG. 2 depicts a block diagram of a system of accelerators for scalableacceleration of database query operations in accordance with anexemplary embodiment;

FIG. 3 depicts a block diagram of an accelerator in accordance with anexemplary embodiment;

FIG. 4 depicts a block diagram of a distribution of database queryoperations across a plurality of accelerators in accordance with anexemplary embodiment;

FIG. 5 depicts a block diagram of a distribution of database queryoperations across a plurality of accelerators in accordance with anexemplary embodiment;

FIG. 6 depicts a block diagram of a distribution of database queryoperations across a plurality of accelerators in accordance with anexemplary embodiment;

FIG. 7 depicts a block diagram of a distribution of database queryoperations across a plurality of accelerators in accordance with anexemplary embodiment; and

FIG. 8 depicts a flow diagram of a method for accelerating multiplequery processing operations in accordance with an exemplary embodiment.

DETAILED DESCRIPTION

Embodiments disclosed herein include a system of accelerators forscalable acceleration of database query operations. In exemplaryembodiments, one or more query processing operations are offloaded tomultiple accelerators, thereby increasing the amount of hardwareresources available to each query processing operation. In addition, byusing multiple accelerators inter-query and/or intra-query parallelismcan be increased. As a result, the performance of the database queryoperations is improved. For example, the speed and capacity of thedatabase query operations can be increased.

Referring now to FIG. 1, a block diagram of an exemplary computer system100 for use with the teachings herein is shown. The methods describedherein can be implemented in hardware software (e.g., firmware), or acombination thereof. In an exemplary embodiment, the methods describedherein are implemented in hardware, and is part of the microprocessor ofa special or general-purpose digital computer, such as a personalcomputer, workstation, minicomputer, or mainframe computer. The system100 therefore includes general-purpose computer 101.

In an exemplary embodiment, in terms of hardware architecture, as shownin FIG. 1, the computer 101 includes a processor 105, memory 110 coupledvia a memory controller 115, a storage device 120, and one or more inputand/or output (I/O) devices 140, 145 (or peripherals) that arecommunicatively coupled via a local input/output controller 135. Theinput/output controller 135 can be, for example, but not limited to, oneor more buses or other wired or wireless connections, as is known in theart. The input/output controller 135 may have additional elements, whichare omitted for simplicity, such as controllers, buffers (caches),drivers, repeaters, and receivers, to enable communications. Further,the local interface may include address, control, and/or dataconnections to enable appropriate communications among theaforementioned components. The storage device 120 may include one ormore hard disk drives (HDDs), solid state drives (SSDs), or any othersuitable form of storage.

The processor 105 is a computing device for executing hardwareinstructions or software, particularly that stored in memory 110. Theprocessor 105 can be any custom made or commercially availableprocessor, a central processing unit (CPU), an auxiliary processor amongseveral processors associated with the computer 101, a semiconductorbased microprocessor (in the form of a microchip or chip set), amacroprocessor, or generally any device for executing instructions. Theprocessor 105 may include a cache 170, which may be organized as ahierarchy of more cache levels (L1, L2, etc.).

The memory 110 can include any one or combination of volatile memoryelements (e.g., random access memory (RAM, such as DRAM, SRAM, SDRAM,etc.)) and nonvolatile memory elements (e.g., ROM, erasable programmableread only memory (EPROM), electronically erasable programmable read onlymemory (EEPROM), programmable read only memory (PROM), tape, compactdisc read only memory (CD-ROM), disk, diskette, cartridge, cassette orthe like, etc.). Moreover, the memory 110 may incorporate electronic,magnetic, optical, and/or other types of storage media. Note that thememory 110 can have a distributed architecture, where various componentsare situated remote from one another, but can be accessed by theprocessor 105.

The instructions in memory 110 may include one or more separateprograms, each of which comprises an ordered listing of executableinstructions for implementing logical functions. In the example of FIG.1, the instructions in the memory 110 include a suitable operatingsystem (OS) 111. The operating system 111 essentially controls theexecution of other computer programs and provides scheduling,input-output control, file and data management, memory management, andcommunication control and related services.

In an exemplary embodiment, a conventional keyboard 150 and mouse 155can be coupled to the input/output controller 135. Other output devicessuch as the I/O devices 140, 145 may include input devices, for examplebut not limited to a printer, a scanner, microphone, and the like.Finally, the I/O devices 140, 145 may further include devices thatcommunicate both inputs and outputs, for instance but not limited to, anetwork interface card (NIC) or modulator/demodulator (for accessingother files, devices, systems, or a network), a radio frequency (RF) orother transceiver, a telephonic interface, a bridge, a router, and thelike. The system 100 can further include a display controller 125coupled to a display 130. In an exemplary embodiment, the system 100 canfurther include a network interface 160 for coupling to a network 165.The network 165 can be an IP-based network for communication between thecomputer 101 and any external server, client and the like via abroadband connection. The network 165 transmits and receives databetween the computer 101 and external systems. In an exemplaryembodiment, network 165 can be a managed IP network administered by aservice provider. The network 165 may be implemented in a wirelessfashion, e.g., using wireless protocols and technologies, such as Wi-Fi,WiMax, etc. The network 165 can also be a packet-switched network suchas a local area network, wide area network, metropolitan area network,Internet network, or other similar type of network environment. Thenetwork 165 may be a fixed wireless network, a wireless local areanetwork (LAN), a wireless wide area network (WAN) a personal areanetwork (PAN), a virtual private network (VPN), intranet or othersuitable network system and includes equipment for receiving andtransmitting signals.

If the computer 101 is a PC, workstation, intelligent device or thelike, the instructions in the memory 110 may further include a basicinput output system (BIOS) (omitted for simplicity). The BIOS is a setof essential routines that initialize and test hardware at startup,start the OS 111, and support the transfer of data among the storagedevices. The BIOS is stored in ROM so that the BIOS can be executed whenthe computer 101 is activated.

When the computer 101 is in operation, the processor 105 is configuredto execute instructions stored within the memory 110, to communicatedata to and from the memory 110, and to generally control operations ofthe computer 101 pursuant to the instructions. In exemplary embodiments,the computer system 100 includes one or more accelerators 180 that areconfigured to communicate with the processor 105. The accelerator 180may be a field programmable gate array (FPGA) or other suitable devicethat is configured to perform specific processing tasks. In exemplaryembodiments, the computer system 100 may be configured to offloadcertain processing tasks to an accelerator 180 because the accelerator180 can perform the processing tasks more efficiently than the processor105.

Referring now to FIG. 2, a block diagram illustrating a system 200having multiple accelerators 206 for accelerating database queryoperations in accordance with an exemplary embodiment is shown. Thesystem 200 includes a host 204, which may be a computer as shown in FIG.1 having a central processing unit configured to execute databasemanagement software. In exemplary embodiments, the host 204 receivesdatabase queries from an application 202 and responsively offloads oneor more query processing operations to one or more of the accelerators206.

In exemplary embodiments, the host 204 includes a query optimizer 208,which receives a query from an application 202 and performs analysis onthe query. Based on the analysis of the query, the query optimizer 208selects one or more accelerator 206 from a plurality of accelerators toexecute the query processing operations. In exemplary embodiments, thequery optimizer 208 may also select an accelerator template from aplurality of accelerator templates that are available for each of theaccelerators 206. In exemplary embodiments, each of the plurality ofaccelerator templates is a stored processing configuration that theaccelerator 206 is capable of executing.

In exemplary embodiments, each accelerator 206, and acceleratortemplate, has a cost model associated with it. The cost model includesthe throughput and the latency of the accelerator/template. Eachaccelerator 206 also has a status that is reported to the host 204. Thestatus indicates whether and when the accelerator 206 is available. Inexemplary embodiments, the cost model and status information are used bythe query optimizer 208 to determine a query execution plan having anoptimized performance and resource utilization. This information, incombination with other software operator cost, is used by the queryoptimizer 208 to determine a query execution plan including which queryoperations to off-loaded, which accelerators to use, and how themultiple accelerated operators and software operators should becombined. The host 204 can decide optimization goals among variousoptions such as shortest query time, maximizing accelerator utilization,or minimizing the use of host resources (such as CPU and memory). Inexemplary embodiments, the query optimizer 208 uses dynamic programming,heuristics, or other optimization algorithms or the combinations thereofto determine a query plan with specified optimization goal(s).

In exemplary embodiments, multiple accelerators 206 can be arranged inthe system 200 in a variety of configurations. For example, multipleaccelerator chips may be located on a single accelerator card (e.g. PCIecard), a single accelerator chip may be located on each of multipleaccelerator cards in the system, or a combination of the twoarrangements can be used. In exemplary embodiments, the communicationamong different accelerators can be performed in a variety a ways basedon the system configuration. For example, communication among differentaccelerators can be direct chip-to-chip communication, peer-to-peercommunication over a system bus, or communication via the host CPUmemory. In exemplary embodiments, pipelined execution of database queryoperation across different accelerators can reduce the latency of datatransfer from one accelerator to the next and maintain high sustainedquery processing throughput. In exemplary embodiments, a plurality ofaccelerators can be heterogeneous and can be accelerating differentparts of a single query or different queries in parallel.

In exemplary embodiments, a database query may involve multipleoperations such as decompression, predicate evaluation, projection,sort, joins etc. Performing these operations on an accelerator, such asan FPGA, can boost the database query performance. Moreover, concurrentand/or pipelined execution of more than one operations on theaccelerator, as shown in FIG. 3, provides an increase in the processingoffloaded by the host, better amortization of set-up/teardown and datatransfer overheads, and higher overall performance of query processing.

Referring now to FIG. 3, a block diagram of an accelerator 310 is shown.As illustrated the accelerator 310 is configured to perform a pluralityof query operations and includes a module corresponding to each of theplurality of query operations. In particular, the accelerator 310includes a page unpacking module 311, a decompression module 312, apredicate evaluation module 313, a projection module 314, a join module315, a sort module 316 and a page packing module 317.

In one embodiment, multiple query operations may be offloaded onto asingle accelerator, as shown in FIG. 3. In other embodiments, multiplequery operations of a database query may be offloaded across a pluralityof accelerators, which may result in increased overall performance ofthe database query. In exemplary embodiments, the plurality ofaccelerators may be arranged in a pipelined/concurrent fashion toaccelerate the query operations. In addition, the accelerators may be ofthe same type or different type. For example, a system with multipleaccelerators may consist of multiple FPGAs, while another system mayconsist of a combination of FPGAs, GPUs and other accelerators. Inexemplary embodiments, multiple accelerators can be exploited toaccelerate one or more operators within a database query or foraccelerating multiple queries in parallel in a variety of differentways.

Referring now to FIG. 4, a block diagram of a distribution of databasequery operations across a plurality of accelerators is shown. Asillustrated, each of the database query operations is disposed on aseparate accelerator. In particular, a first accelerator 410 includes apage unpacking module 411, a second accelerator 420 includes adecompression module 421, a third accelerator 430 includes a predicateevaluation module 331, a fourth accelerator 440 includes a projectionmodule 441, a fifth accelerator 450 includes a join module 451, a sixthaccelerator 460 includes a sort module 461 and a seventh accelerator 470includes a page packing module 471. In exemplary embodiments, a singleoperation may be decomposed into multiple parts and a single acceleratormay iteratively execute the multiple parts, before forwarding theresults to the next accelerator.

Referring now to FIG. 5, a block diagram of a distribution of databasequery operations across a plurality of accelerators is shown. Asillustrated, one or more accelerators include multiple database queryoperations and some accelerators only include a single database queryoperation. In particular, a first accelerator 510 includes a pageunpacking module 511 and a decompression module 512, a secondaccelerator 520 includes a predicate evaluation module 521 and aprojection module 522, a third accelerator 530 includes a join module531, a fourth accelerator 540 includes a sort module 541, and a fifthaccelerator 550 includes a page packing module 551.

Referring now to FIG. 6, a block diagram of a distribution of databasequery operations across a plurality of accelerators is shown. Asillustrated, one or more database query operations may be disposedacross multiple accelerators. In particular, a first accelerator 610includes a page unpacking module 611, a second accelerator 620 includesa decompression module 621, a third accelerator 630 includes a firstpart of predicate evaluation module 631, a fourth accelerator 640includes a second part of predicate evaluation module 641, a fifthaccelerator 650 includes a projection module 651, a sixth accelerator660 includes a join module 661, a seventh accelerator 670 includes asort module 671, and an eighth accelerator 680 includes a page packingmodule 681.

Referring now to FIG. 7, a block diagram of a distribution of databasequery operations across a plurality of accelerators is shown. Asillustrated, all of the database query operations may be disposed on asingle accelerator 710 and one or more accelerators 720, 730 may beconfigured to work concurrently. In exemplary embodiments, theindividual accelerators 710, 720, 730 may be configured to workindependently on different parts of a database table for a singledatabase query. In other exemplary embodiments, all of the databasequery operations for a database query may be disposed on a singleaccelerator 710, with multiple accelerators 720, 730 workingconcurrently and independently on different queries.

Referring now to FIG. 8, a flow diagram illustrating a method 800 fordistributing database query operations across a plurality ofaccelerators according to an embodiment is shown. As shown at block 802,the method 800 includes receiving a database query from an application.Next, as shown at block 804, the method 800 includes performing ananalysis on the query. The method 800 also includes identifying aplurality of available accelerators, as shown at block 806. Next, asshown at block 808, the method 800 includes retrieve a cost informationfor one or more templates available on each of the plurality ofavailable accelerators. The method 800 also includes determining a queryexecution plan based on the cost information and the analysis on thequery, as shown at block 810. Next, as shown at block 812, the method800 includes offload one or more query operations to at least one of theplurality of accelerators based on the query execution plan.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readablestorage medium. A computer readable storage medium may be, for example,but not limited to, an electronic, magnetic, optical, electromagnetic,infrared, or semiconductor system, apparatus, or device, or any suitablecombination of the foregoing. More specific examples (a non-exhaustivelist) of the computer readable storage medium would include thefollowing: an electrical connection having one or more wires, a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), an optical fiber, a portable compact disc read-onlymemory (CD-ROM), an optical storage device, a magnetic storage device,or any suitable combination of the foregoing. In the context of thisdocument, a computer readable storage medium may be any tangible mediumthat can contain, or store a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The disclosed flowchart and block diagrams illustrate the architecture,functionality, and operation of possible implementations of systems,methods and computer program products according to various embodimentsof the present invention. In this regard, each block in the flowchart orblock diagrams may represent a module, segment, or portion of code,which comprises one or more executable instructions for implementing thespecified logical function(s). It should also be noted that, in somealternative implementations, the functions noted in the block may occurout of the order noted in the figures. For example, two blocks shown insuccession may, in fact, be executed substantially concurrently, or theblocks may sometimes be executed in the reverse order, depending uponthe functionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts, or combinations of special purpose hardware andcomputer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, element components,and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

The flow diagrams depicted herein are just one example. There may bemany variations to this diagram or the steps (or operations) describedtherein without departing from the spirit of the invention. Forinstance, the steps may be performed in a differing order or steps maybe added, deleted or modified. All of these variations are considered apart of the claimed invention.

While the preferred embodiment to the invention had been described, itwill be understood that those skilled in the art, both now and in thefuture, may make various improvements and enhancements which fall withinthe scope of the claims which follow. These claims should be construedto maintain the proper protection for the invention first described.

What is claimed is:
 1. A system comprising a processing deviceconfigured to: receive a database query from an application; perform ananalysis on the query; identify a plurality of available accelerators;retrieve a cost information for each of a plurality of acceleratortemplates available on each of the plurality of available accelerators,wherein each of the plurality of accelerator templates representdifferent stored processing configurations that the accelerator iscapable of executing; determine a query execution plan based on the costinformation and the analysis on the query, wherein the determinationincludes selecting an accelerator template from the plurality ofaccelerator templates available on at least one of the plurality ofavailable accelerators; and offload one or more query operations to atleast one of the plurality of accelerators based on the query executionplan, wherein the at least one of the plurality of accelerators based onthe query execution plan is configured according to the selectedaccelerator template.
 2. The system of claim 1, wherein the costinformation includes a throughput and a latency of the one or moreaccelerator templates available on each of the plurality of availableaccelerators.
 3. The system of claim 1, wherein the database queryincludes a plurality of query operations.
 4. The system of claim 3,wherein query execution plan includes assigning each of the plurality ofquery operations to a different one of the plurality of availableaccelerators.
 5. The system of claim 3, wherein query execution planincludes assigning two or more of the plurality of query operations toone of the plurality of available accelerators.
 6. The system of claim3, wherein query execution plan includes assigning all of the pluralityof query operations to one of the plurality of available accelerators.7. The system of claim 3, wherein query execution plan includessplitting the database query into multiple parts and assigning a firstpart of one of the plurality of query operations to one of the pluralityof available accelerators and assigning a second part of the one of theplurality of query operations to another one of the plurality ofavailable accelerators.
 8. A computer program product, comprising: anon-transitory computer readable storage medium having computer readableprogram code stored thereon that, when executed, performs a method, themethod comprising: receiving, by a processing device, a database queryfrom an application; performing an analysis on the query; identifying aplurality of available accelerators; retrieving a cost information foreach of a plurality of accelerator templates available on each of theplurality of available accelerators, wherein each of the plurality ofaccelerator templates represent different stored processingconfigurations that the accelerator is capable of executing; determininga query execution plan based on the cost information and the analysis onthe query, wherein the determination includes selecting an acceleratortemplate from the plurality of accelerator templates available on atleast one of the plurality of available accelerators; and offloading oneor more query operations to at least one of the plurality ofaccelerators based on the query execution plan, wherein the at least oneof the plurality of accelerators based on the query execution plan isconfigured according to the selected accelerator template.
 9. Thecomputer program product of claim 8, wherein the cost informationincludes a throughput and a latency of the one or more acceleratortemplates available on each of the plurality of available accelerators.10. The computer program product of claim 8, wherein the database queryincludes a plurality of query operations.
 11. The computer programproduct of claim 10, wherein query execution plan includes assigningeach of the plurality of query operations to a different one of theplurality of available accelerators.
 12. The computer program product ofclaim 10, wherein query execution plan includes assigning two or more ofthe plurality of query operations to one of the plurality of availableaccelerators.